________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 21:04:46
Input Data from:  dataset149.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :20
Ex.Facilities   :2
Total budget    :25000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,06
Average f[i]   :4450
Average g[i,j] :2013,88888888889
Total demand   :11380
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 55
> Selected Move:	1800	1	-1	15	4500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0    >new incumb.: 1800


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 55
> Selected Move:	2540	1	-1	9	8500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0    >new incumb.: 2540


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 68
> Selected Move:	3200	1	-1	2	12500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0    >new incumb.: 3200


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 87
> Selected Move:	3820	1	-1	8	18000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  0  0  0  0  1  0  0  0  0    >new incumb.: 3820


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 93
> Selected Move:	4410	1	-1	7	22500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  1  0  0  0  0  0  1  0  0  0  0    >new incumb.: 4410


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 88
> Selected Move:	4370	3	7	6	24000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 72
> Selected Move:	4340	3	6	16	22000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 104
> Selected Move:	4320	3	16	10	24000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 71
> Selected Move:	4300	3	10	12	24000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 71
> Selected Move:	4290	3	12	3	23000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 80
> Selected Move:	4270	3	3	11	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 58
> Selected Move:	4250	3	11	17	22000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 99
> Selected Move:	4350	3	15	19	22500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 97
> Selected Move:	4320	3	8	7	21500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 98
> Selected Move:	4530	1	-1	16	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 46
> Selected Move:	4660	3	19	15	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  0  0  0  1  1  1  0  0    >new incumb.: 4660


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 69
> Selected Move:	4590	3	17	14	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 67
> Selected Move:	4580	3	16	17	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 68
> Selected Move:	4560	3	14	13	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 70
> Selected Move:	4570	3	17	16	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 69
> Selected Move:	4550	3	15	17	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 64
> Selected Move:	4530	3	16	5	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 58
> Selected Move:	4500	3	13	16	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1  0  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 51
> Selected Move:	4570	3	7	15	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 73
> Selected Move:	4510	3	5	14	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  0  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 74
> Selected Move:	4610	3	15	19	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 56
> Selected Move:	4480	3	16	7	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 50
> Selected Move:	4470	3	19	13	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 64
> Selected Move:	4490	3	17	15	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 50
> Selected Move:	4420	3	7	16	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 72
> Selected Move:	4500	3	13	5	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1  0  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 69
> Selected Move:	4480	3	14	13	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1  0  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 65
> Selected Move:	4490	3	5	17	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 82
> Selected Move:	4460	3	15	5	24500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 60
> Selected Move:	4490	3	13	19	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1  0  0  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 54
> Selected Move:	4400	3	5	13	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  0  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 76
> Selected Move:	4400	3	19	14	24000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 64
> Selected Move:	4440	3	13	7	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 58
> Selected Move:	4420	3	9	15	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  0  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 72
> Selected Move:	4370	3	2	9	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  1  0  0  0  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 82
> Selected Move:	4350	3	14	13	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  1  0  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 82
> Selected Move:	4320	3	15	5	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  1  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 63
> Selected Move:	4290	3	5	4	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  1  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 76
> Selected Move:	4340	3	7	2	25000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 80
> Selected Move:	4360	3	4	3	25000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  1  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 74
> Selected Move:	4378	3	17	15	25500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  1  0  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 76
> Selected Move:	4400	3	13	7	26000


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  1  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 77
> Selected Move:	4503	3	3	5	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 77
> Selected Move:	4495	3	16	17	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 49 #######################


> Neighbours evaluated; 81
> Selected Move:	4445	3	15	19	26000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 50 #######################


> Neighbours evaluated; 62
> Selected Move:	4420	3	19	14	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 51 #######################


> Neighbours evaluated; 64
> Selected Move:	4418	3	17	15	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 52 #######################


> Neighbours evaluated; 50
> Selected Move:	4410	3	7	17	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1  0  0  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 53 #######################


> Neighbours evaluated; 79
> Selected Move:	4390	3	14	13	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1  0  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 54 #######################


> Neighbours evaluated; 78
> Selected Move:	4390	3	17	7	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 55 #######################


> Neighbours evaluated; 58
> Selected Move:	4320	3	7	14	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1  0  0  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 56 #######################


> Neighbours evaluated; 58
> Selected Move:	4330	3	5	17	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  0  1  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 57 #######################


> Neighbours evaluated; 82
> Selected Move:	4320	3	9	7	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  0  1  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 58 #######################


> Neighbours evaluated; 74
> Selected Move:	4330	3	17	16	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 59 #######################


> Neighbours evaluated; 76
> Selected Move:	4310	3	15	17	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 60 #######################


> Neighbours evaluated; 57
> Selected Move:	4360	3	13	19	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 61 #######################


> Neighbours evaluated; 56
> Selected Move:	4313	3	2	9	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  1  0  0  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 62 #######################


> Neighbours evaluated; 62
> Selected Move:	4275	3	17	2	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 63 #######################


> Neighbours evaluated; 65
> Selected Move:	4220	3	19	13	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 64 #######################


> Neighbours evaluated; 64
> Selected Move:	4460	3	1	15	26100


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  0  1  0  0  0  1  1  3  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 65 #######################


> Neighbours evaluated; 65
> Selected Move:	4456	3	16	17	26100


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  0  1  0  0  0  1  1  3  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 66 #######################


> Neighbours evaluated; 63
> Selected Move:	4470	3	15	16	26000


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  0  1  0  0  0  1  1  0  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 67 #######################


> Neighbours evaluated; 52
> Selected Move:	4435	4	16	7	26100


> New Y[]: 
	
	 2  0  1  0  0  0  0  3  0  1  0  0  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 68 #######################


> Neighbours evaluated; 49
> Selected Move:	4429	4	7	17	26100


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  0  1  0  0  0  1  1  0  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 69 #######################


> Neighbours evaluated; 51
> Selected Move:	4392	4	17	13	26200


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  0  1  0  0  0  3  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 70 #######################


> Neighbours evaluated; 55
> Selected Move:	4330	2	16	-1	22200


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  0  1  0  0  0  3  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 71 #######################


> Neighbours evaluated; 88
> Selected Move:	4350	3	17	15	22700


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  0  1  0  0  0  3  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 72 #######################


> Neighbours evaluated; 86
> Selected Move:	4350	4	13	2	23100


> New Y[]: 
	
	 2  0  3  0  0  0  0  1  0  1  0  0  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 73 #######################


> Neighbours evaluated; 82
> Selected Move:	4350	4	2	7	22600


> New Y[]: 
	
	 2  0  1  0  0  0  0  3  0  1  0  0  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 74 #######################


> Neighbours evaluated; 84
> Selected Move:	4350	4	7	9	23400


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  0  3  0  0  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 75 #######################


> Neighbours evaluated; 74
> Selected Move:	4350	4	9	14	23100


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  0  1  0  0  0  1  3  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 76 #######################


> Neighbours evaluated; 79
> Selected Move:	4350	4	14	15	22100


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  0  1  0  0  0  1  1  3  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 77 #######################


> Neighbours evaluated; 93
> Selected Move:	4330	3	15	17	22100


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  0  1  0  0  0  1  1  0  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 78 #######################


> Neighbours evaluated; 86
> Selected Move:	4330	4	17	2	22600


> New Y[]: 
	
	 2  0  3  0  0  0  0  1  0  1  0  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 79 #######################


> Neighbours evaluated; 85
> Selected Move:	4330	4	2	7	22100


> New Y[]: 
	
	 2  0  1  0  0  0  0  3  0  1  0  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 80 #######################


> Neighbours evaluated; 83
> Selected Move:	4330	4	7	9	22900


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  0  3  0  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 81 #######################


> Neighbours evaluated; 80
> Selected Move:	4330	4	9	14	22600


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  0  1  0  0  0  1  3  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 82 #######################


> Neighbours evaluated; 95
> Selected Move:	4274	1	-1	16	26600


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  0  1  0  0  0  1  3  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 83 #######################


> Neighbours evaluated; 47
> Selected Move:	4282	4	14	2	26600


> New Y[]: 
	
	 2  0  3  0  0  0  0  1  0  1  0  0  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 84 #######################


> Neighbours evaluated; 49
> Selected Move:	4260	3	2	1	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  1  0  0  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 85 #######################


> Neighbours evaluated; 58
> Selected Move:	4290	3	7	4	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  0  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 86 #######################


> Neighbours evaluated; 85
> Selected Move:	4270	3	17	2	25000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1  0  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 87 #######################


> Neighbours evaluated; 86
> Selected Move:	4278	3	14	7	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  1  0  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 88 #######################


> Neighbours evaluated; 85
> Selected Move:	4280	3	4	5	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1  0  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 89 #######################


> Neighbours evaluated; 83
> Selected Move:	4230	3	9	17	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 90 #######################


> Neighbours evaluated; 58
> Selected Move:	4290	3	16	14	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 91 #######################


> Neighbours evaluated; 59
> Selected Move:	4300	3	7	9	24500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1  0  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 92 #######################


> Neighbours evaluated; 66
> Selected Move:	4380	3	13	19	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 93 #######################


> Neighbours evaluated; 72
> Selected Move:	4350	3	19	16	24500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 94 #######################


> Neighbours evaluated; 73
> Selected Move:	4360	3	14	8	26000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  1  0  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 95 #######################


> Neighbours evaluated; 63
> Selected Move:	4525	3	5	15	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 96 #######################


> Neighbours evaluated; 95
> Selected Move:	4510	3	15	19	26500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  0  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 97 #######################


> Neighbours evaluated; 65
> Selected Move:	4455	3	19	7	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  1  0  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 98 #######################


> Neighbours evaluated; 76
> Selected Move:	4475	3	17	15	26500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  1  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 99 #######################


> Neighbours evaluated; 83
> Selected Move:	4458	3	16	17	26500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  1  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 100 #######################


> Neighbours evaluated; 84
> Selected Move:	4420	3	15	19	27000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  1  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 101 #######################


> Neighbours evaluated; 62
> Selected Move:	4338	3	8	13	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 102 #######################


> Neighbours evaluated; 88
> Selected Move:	4310	3	19	8	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  1  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 103 #######################


> Neighbours evaluated; 64
> Selected Move:	4373	3	7	16	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 104 #######################


> Neighbours evaluated; 68
> Selected Move:	4330	3	13	14	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 105 #######################


> Neighbours evaluated; 61
> Selected Move:	4335	3	17	15	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 106 #######################


> Neighbours evaluated; 69
> Selected Move:	4405	3	8	3	25500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  1  0  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 107 #######################


> Neighbours evaluated; 79
> Selected Move:	4325	3	16	7	26000


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  1  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 108 #######################


> Neighbours evaluated; 57
> Selected Move:	4300	3	14	13	26000


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  1  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 109 #######################


> Neighbours evaluated; 65
> Selected Move:	4278	3	15	17	25500


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  1  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 110 #######################


> Neighbours evaluated; 75
> Selected Move:	4255	3	3	4	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  1  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 111 #######################


> Neighbours evaluated; 78
> Selected Move:	4223	3	13	16	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  1  0  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 112 #######################


> Neighbours evaluated; 78
> Selected Move:	4240	3	4	3	25500


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  1  0  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 113 #######################


> Neighbours evaluated; 67
> Selected Move:	4308	3	7	15	25500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  1  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 114 #######################


> Neighbours evaluated; 84
> Selected Move:	4280	3	17	5	26000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  1  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 115 #######################


> Neighbours evaluated; 70
> Selected Move:	4258	3	3	8	26500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  1  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 116 #######################


> Neighbours evaluated; 62
> Selected Move:	4240	2	16	-1	22500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 117 #######################


> Neighbours evaluated; 83
> Selected Move:	4210	3	8	7	21500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 118 #######################


> Neighbours evaluated; 80
> Selected Move:	4290	3	5	10	23000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 119 #######################


> Neighbours evaluated; 87
> Selected Move:	4270	3	10	12	23000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 120 #######################


> Neighbours evaluated; 87
> Selected Move:	4260	3	12	3	22000


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 121 #######################


> Neighbours evaluated; 87
> Selected Move:	4240	3	1	8	24300


> New Y[]: 
	
	 2  0  1  1  0  0  0  1  3  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 122 #######################


> Neighbours evaluated; 47
> Selected Move:	4320	3	3	14	23300


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  3  1  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 123 #######################


> Neighbours evaluated; 69
> Selected Move:	4320	4	8	2	24600


> New Y[]: 
	
	 2  0  3  0  0  0  0  1  1  1  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 124 #######################


> Neighbours evaluated; 47
> Selected Move:	4320	4	2	7	24100


> New Y[]: 
	
	 2  0  1  0  0  0  0  3  1  1  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 125 #######################


> Neighbours evaluated; 59
> Selected Move:	4320	4	7	9	24900


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  1  3  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 126 #######################


> Neighbours evaluated; 47
> Selected Move:	4320	4	9	14	24600


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  1  1  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 127 #######################


> Neighbours evaluated; 49
> Selected Move:	4320	4	14	15	23600


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  1  1  0  0  0  0  1  3  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 128 #######################


> Neighbours evaluated; 78
> Selected Move:	4240	3	14	3	24600


> New Y[]: 
	
	 2  0  1  1  0  0  0  1  1  1  0  0  0  0  0  3  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 129 #######################


> Neighbours evaluated; 53
> Selected Move:	4240	4	15	3	24600


> New Y[]: 
	
	 2  0  1  3  0  0  0  1  1  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 130 #######################


> Neighbours evaluated; 47
> Selected Move:	4270	3	3	10	25000


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  1  1  3  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 131 #######################


> Neighbours evaluated; 52
> Selected Move:	4250	3	10	12	24900


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  1  1  0  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 132 #######################


> Neighbours evaluated; 51
> Selected Move:	4220	3	12	11	24900


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  1  1  0  3  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 133 #######################


> Neighbours evaluated; 51
> Selected Move:	4210	3	11	16	24000


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  1  1  0  0  0  0  0  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 134 #######################


> Neighbours evaluated; 70
> Selected Move:	4210	4	16	2	24600


> New Y[]: 
	
	 2  0  3  0  0  0  0  1  1  1  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 135 #######################


> Neighbours evaluated; 69
> Selected Move:	4210	4	2	7	24100


> New Y[]: 
	
	 2  0  1  0  0  0  0  3  1  1  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 136 #######################


> Neighbours evaluated; 69
> Selected Move:	4211	3	16	3	25100


> New Y[]: 
	
	 2  0  1  1  0  0  0  3  1  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 137 #######################


> Neighbours evaluated; 46
> Selected Move:	4200	3	3	17	24100


> New Y[]: 
	
	 2  0  1  0  0  0  0  3  1  1  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 138 #######################


> Neighbours evaluated; 69
> Selected Move:	4300	3	15	19	24600


> New Y[]: 
	
	 2  0  1  0  0  0  0  3  1  1  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 139 #######################


> Neighbours evaluated; 61
> Selected Move:	4300	4	7	8	23800


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  3  1  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 140 #######################


> Neighbours evaluated; 70
> Selected Move:	4300	4	8	17	24600


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  1  1  0  0  0  0  0  0  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 141 #######################


> Neighbours evaluated; 62
> Selected Move:	4300	4	17	19	23700


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  1  1  0  0  0  0  0  0  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 142 #######################


> Neighbours evaluated; 71
> Selected Move:	4274	4	19	2	25100


> New Y[]: 
	
	 2  0  3  0  0  0  0  1  1  1  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 143 #######################


> Neighbours evaluated; 48
> Selected Move:	4290	3	2	1	23000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 144 #######################


> Neighbours evaluated; 92
> Selected Move:	4450	3	19	18	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1  0  0  0  0  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 145 #######################


> Neighbours evaluated; 73
> Selected Move:	4370	3	7	16	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  0  0  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 146 #######################


> Neighbours evaluated; 77
> Selected Move:	4280	3	17	15	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  0  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 147 #######################


> Neighbours evaluated; 92
> Selected Move:	4360	3	16	7	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 148 #######################


> Neighbours evaluated; 93
> Selected Move:	4260	3	18	10	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 149 #######################


> Neighbours evaluated; 78
> Selected Move:	4240	3	10	12	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 150 #######################


> Neighbours evaluated; 77
> Selected Move:	4230	3	12	3	23500


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 151 #######################


> Neighbours evaluated; 76
> Selected Move:	4343	1	-1	2	27500


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  1  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 152 #######################


> Neighbours evaluated; 53
> Selected Move:	4410	3	3	5	27000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 153 #######################


> Neighbours evaluated; 62
> Selected Move:	4383	3	5	14	26500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  1  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 154 #######################


> Neighbours evaluated; 75
> Selected Move:	4340	3	15	17	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  1  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 155 #######################


> Neighbours evaluated; 77
> Selected Move:	4388	3	14	5	26500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  1  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 156 #######################


> Neighbours evaluated; 82
> Selected Move:	4370	3	7	15	26500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  1  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 157 #######################


> Neighbours evaluated; 96
> Selected Move:	4360	3	15	19	27000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  1  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 158 #######################


> Neighbours evaluated; 74
> Selected Move:	4315	3	5	14	26500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 159 #######################


> Neighbours evaluated; 81
> Selected Move:	4315	3	19	15	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  0  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 160 #######################


> Neighbours evaluated; 92
> Selected Move:	4230	3	9	16	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  0  0  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 161 #######################


> Neighbours evaluated; 83
> Selected Move:	4330	3	8	5	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  0  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 162 #######################


> Neighbours evaluated; 95
> Selected Move:	4315	3	15	19	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 163 #######################


> Neighbours evaluated; 69
> Selected Move:	4265	3	16	7	26000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 164 #######################


> Neighbours evaluated; 70
> Selected Move:	4280	3	19	15	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 165 #######################


> Neighbours evaluated; 83
> Selected Move:	4288	3	17	16	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 166 #######################


> Neighbours evaluated; 83
> Selected Move:	4260	3	15	17	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 167 #######################


> Neighbours evaluated; 61
> Selected Move:	4220	3	7	13	24500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 168 #######################


> Neighbours evaluated; 62
> Selected Move:	4250	3	5	15	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  0  1  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 169 #######################


> Neighbours evaluated; 89
> Selected Move:	4260	3	14	7	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 170 #######################


> Neighbours evaluated; 88
> Selected Move:	4205	3	13	5	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 171 #######################


> Neighbours evaluated; 71
> Selected Move:	4293	3	2	9	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  1  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 172 #######################


> Neighbours evaluated; 85
> Selected Move:	4270	3	7	14	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  0  0  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 173 #######################


> Neighbours evaluated; 89
> Selected Move:	4250	3	14	13	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 174 #######################


> Neighbours evaluated; 89
> Selected Move:	4210	3	15	4	25500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  1  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 175 #######################


> Neighbours evaluated; 90
> Selected Move:	4193	3	17	2	25500


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  0  1  0  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 176 #######################


> Neighbours evaluated; 85
> Selected Move:	4170	3	2	7	26000


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  1  0  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 177 #######################


> Neighbours evaluated; 79
> Selected Move:	4243	3	5	14	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  1  0  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 178 #######################


> Neighbours evaluated; 83
> Selected Move:	4280	3	4	15	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  1  0  0  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 179 #######################


> Neighbours evaluated; 80
> Selected Move:	4270	3	16	17	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  1  0  0  0  1  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 180 #######################


> Neighbours evaluated; 84
> Selected Move:	4240	3	15	5	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  1  0  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 181 #######################


> Neighbours evaluated; 56
> Selected Move:	4223	3	5	4	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  1  0  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 182 #######################


> Neighbours evaluated; 84
> Selected Move:	4190	3	13	16	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  1  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 183 #######################


> Neighbours evaluated; 70
> Selected Move:	4230	3	7	2	25000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 184 #######################


> Neighbours evaluated; 81
> Selected Move:	4250	3	4	3	25000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  1  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 185 #######################


> Neighbours evaluated; 70
> Selected Move:	4255	3	14	19	26000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 186 #######################


> Neighbours evaluated; 59
> Selected Move:	4270	3	3	15	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 187 #######################


> Neighbours evaluated; 91
> Selected Move:	4250	2	15	-1	21000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 188 #######################


> Neighbours evaluated; 91
> Selected Move:	4280	3	16	6	23000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 189 #######################


> Neighbours evaluated; 88
> Selected Move:	4240	3	2	8	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  1  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 190 #######################


> Neighbours evaluated; 72
> Selected Move:	4220	3	19	2	23500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  1  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 191 #######################


> Neighbours evaluated; 87
> Selected Move:	4260	3	6	7	22000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  1  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 192 #######################


> Neighbours evaluated; 93
> Selected Move:	4250	3	17	19	23000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 193 #######################


> Neighbours evaluated; 94
> Selected Move:	4250	3	2	4	24000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 194 #######################


> Neighbours evaluated; 103
> Selected Move:	4230	3	19	10	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  1  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 195 #######################


> Neighbours evaluated; 101
> Selected Move:	4210	3	10	12	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  1  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 196 #######################


> Neighbours evaluated; 100
> Selected Move:	4200	3	12	3	24000


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  1  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 197 #######################


> Neighbours evaluated; 102
> Selected Move:	4170	3	3	16	23000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  1  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 198 #######################


> Neighbours evaluated; 110
> Selected Move:	4200	3	4	15	22500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 199 #######################


> Neighbours evaluated; 105
> Selected Move:	4233	1	-1	17	26500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 200 #######################


> Neighbours evaluated; 86
> Selected Move:	4210	3	15	19	27000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1  0  0  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 201 #######################


> Neighbours evaluated; 58
> Selected Move:	4275	3	8	5	26000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  1  0  0  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 202 #######################


> Neighbours evaluated; 72
> Selected Move:	4245	3	7	14	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  0  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 203 #######################


> Neighbours evaluated; 69
> Selected Move:	4218	3	17	2	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 204 #######################


> Neighbours evaluated; 66
> Selected Move:	4240	3	14	7	26000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1  0  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 205 #######################


> Neighbours evaluated; 69
> Selected Move:	4255	3	5	15	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 206 #######################


> Neighbours evaluated; 95
> Selected Move:	4240	3	16	17	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 207 #######################


> Neighbours evaluated; 94
> Selected Move:	4275	3	19	3	26000


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  1  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 208 #######################


> Neighbours evaluated; 90
> Selected Move:	4275	3	17	5	26500


> New Y[]: 
	
	 2  3  1  1  0  1  0  1  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 209 #######################


> Neighbours evaluated; 57
> Selected Move:	4175	3	7	14	26000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  1  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 210 #######################


> Neighbours evaluated; 57
> Selected Move:	4230	3	5	13	25500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  1  0  0  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 211 #######################


> Neighbours evaluated; 69
> Selected Move:	4200	3	15	17	25000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  1  0  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 212 #######################


> Neighbours evaluated; 75
> Selected Move:	4240	3	3	19	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  0  1  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 213 #######################


> Neighbours evaluated; 86
> Selected Move:	4180	3	19	4	25000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1  0  0  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 214 #######################


> Neighbours evaluated; 87
> Selected Move:	4190	3	17	7	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  1  0  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 215 #######################


> Neighbours evaluated; 79
> Selected Move:	4200	4	1	2	23600


> New Y[]: 
	
	 2  0  3  0  1  0  0  1  0  1  0  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31
________________________________________________________________

Best solution found: 4660
Run Termination time: 03.02.2010 21:07:09
Run duration: 00:02:23.0625000
________________________________________________________________
